The Revised Face Method in Multidimensional Graph Analyses (2)

Face Recognition by Face Bunch Graph Method

Face Bunch Graph method method uses a simple comparison function both for the localization and the recognition of faces. The input data for the two processes are so-called Jets, which represent image properties in the neighbourhood of a face bunch graph (FBG) node. The algorithm described below was chosen for implementation because of its very good results and because of the application of the ...

A N‎ote on Revised Szeged ‎Index of ‎Graph ‎Operations

Let $G$ be a finite and simple graph with edge set $E(G)$‎. ‎The revised Szeged index is defined as‎ ‎$Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$‎ ‎where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and‎ ‎$n_{G}(e)$ is the number of‎ ‎equidistant vertices of $e$ in $G$‎. ‎In this paper...

Spectral Graph Theory ( revised , 2006 )

A Revised Neural Framework for Face Processing.

Face perception relies on computations carried out in face-selective cortical areas. These areas have been intensively investigated for two decades, and this work has been guided by an influential neural model suggested by Haxby and colleagues in 2000. Here, we review new findings about face-selective areas that suggest the need for modifications and additions to the Haxby model. We suggest a r...

COMPARATIVE ANALYSES OF PARALLEL SIMULATION PROTOCOLS (Revised)

Currently there is not a significant body of comparative, experimental performance results for parallel simulation protocols. Nor is there a body of significant analytic studies. The SPECTRUM Testbed [ReDi89] has been designed to support the empirical study of parallel simulation protocols and applications, with the expectation that experience with the testbed will provide insights into the eff...